Scaling relationship between the copositive cone and Parrilo's first level approximation

نویسندگان

  • Peter J. C. Dickinson
  • Mirjam Dür
  • Luuk Gijben
  • Roland Hildebrand
چکیده

Abstract We investigate the relation between the cone Cn of n×n copositive matrices and the approximating cone K1 n introduced by Parrilo. While these cones are known to be equal for n ≤ 4, we show that for n ≥ 5 they are unequal. This result is based on the fact that K1 n is not invariant under diagonal scaling. We show in fact that for any copositive matrix which is not the sum of a nonnegative and a positive semidefinite matrix we can find a scaling which is not in K1 n . For the 5× 5 case, we show the more surprising result that we can scale any copositive matrix X into K1 5 and in fact that any scaling D such that (DXD)ii ∈ {0, 1} for all i yields DXD ∈ K1 5. From this we are able to use the cone K1 5 to check if any order 5 matrix is copositive. Another consequence of this is a complete characterisation of C5 in terms of K1 5 . We end the paper by formulating several conjectures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Copositive Programming and Standard Quadratic Optimization Problems

A standard quadratic problem consists of nding global maximizers of a quadratic form over the standard simplex. In this paper, the usual semideenite programming relaxation is strengthened by replacing the cone of positive semideenite matrices by the cone of completely positive matrices (the positive semideenite matrices which allow a factorization F F T where F is some non-negative matrix). The...

متن کامل

Approximation of Copositive Programming via Linear Programming Using Second Order Sum of Square Decomposition

In this paper, we improve the previously known result of approximating the cone of copositive matrices. We approximate the cone of copos-itive matrices by a set of linear matrices inequalities using the second order sum of square decomposition. Hence, a copositive programming can be approximated more accurately by a linear programming.

متن کامل

Quadratic factorization heuristics for copositive programming

Copositive optimization problems are particular conic programs: extremize linear forms over the copositive cone subject to linear constraints. Every quadratic program with linear constraints can be formulated as a copositive program, even if some of the variables are binary. So this is an NP-hard problem class. While most methods try to approximate the copositive cone from within, we propose a ...

متن کامل

An Adaptive Linear Approximation Algorithm for Copositive Programs

We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer approximations of the copositive cone which we show to be exact in the limit. In contrast to prev...

متن کامل

Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone

In this paper we construct two approximation hierarchies for the completely positive cone based on symmetric tensors. We show that one hierarchy corresponds to dual cones of a known polyhedral approximation hierarchy for the copositive cone, and the other hierarchy corresponds to dual cones of a known semidefinite approximation hierarchy for the copositive cone. As an application, we consider a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2013